The stochastic time-cost tradeoff problem: A robust optimization approach

نویسندگان

  • Izack Cohen
  • Boaz Golany
  • Avraham Shtub
چکیده

We consider the problem of allocating resources to projects performed under given due dates and stochastic time–cost tradeoff settings. In particular, we show how to implement a state-of-the-art methodology known as “robust optimization” to solve the problem. In contrast to conventional approaches, the model we develop results in management policies rather than optimal values for the original decision variables. Hence, the project manager can postpone decisions to the point of time when they are actually required and then make them according to the optimal policy (which employs cumulative data on the project progress). The solutions are guaranteed to be robust—that is, ensuring feasibility except when the uncertain parameters assume extreme values. Still, as we demonstrate through an extensive numerical example, the price we need to pay to obtain that robustness is relatively small even for high uncertainty levels. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(2), 175–188 2007

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Mathematical Approach based on Conic Quadratic Programming for the Stochastic Time-Cost Tradeoff Problem in Project Management

In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...

متن کامل

A Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm

The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...

متن کامل

Demand-oriented timetable design for urban rail transit under stochastic demand

In the context of public transportation system, improving the service quality and robustness through minimizing the average passengers waiting time is a real challenge. This study provides robust stochastic programming models for train timetabling problem in urban rail transit systems. The objective is minimization of the weighted summation of the expected cost of passenger waiting time, its va...

متن کامل

Robust optimization of a mathematical model to design a dynamic cell formation problem considering labor utilization

Cell formation (CF) problem is one of the most important decision problems in designing a cellular manufacturing system includes grouping machines into machine cells and parts into part families. Several factors should be considered in a cell formation problem. In this work, robust optimization of a mathematical model of a dynamic cell formation problem integrating CF, production planning and w...

متن کامل

A Robust Optimization Approach for a p-Hub Covering Problem with Production Facilities, Time Horizons and Transporter

Hub location-allocation problems are currently a subject of keen interest in the research community. However, when this issue is considered in practice, significant difficulties such as traffic, commodity transportation and telecommunication tend to be overlooked. In this paper, a novel robust mathematical model for a p-hub covering problem, which tackles the intrinsic uncertainty of some param...

متن کامل

AN EXTENSION TO STOCHASTIC TIME-COST TRADE-OFF PROBLEM OPTIMIZATION WITH DISCOUNTED CASH FLOW

In this paper, an efficient multi-objective model is proposed to solve time-cost trade off problem considering cash flows. The proposed multi-objective meta-heuristic is based on Ant colony optimization and is called Non Dominated Archiving Ant Colony Optimization (NAACO). The significant feature of this work is consideration of uncertainties in time, cost and more importantly interest rate. A ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Networks

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2007